220A - Little Elephant and Problem - CodeForces Solution

#include <bits/stdc++.h>
#define present(container, element) (container.find(element) != container.end()
#define all(c) c.begin(), c.end()
#define lli long long int
#define vi vector<int>
#define cpresent(container, element) (find(all(container),element) != container.end())
#define tr(container, it) for(auto it = container.begin(); it != container.end(); it++)
using namespace std;

void solve(int tc){
    int n;
    cin>>n;
    vi ar(n), v(n);
    for(int i=0;i<n;i++){
        cin>>ar[i];
        v[i] = ar[i];
    }
    sort(all(v));
    int t=0;
    for(int i=0;i<n;i++){
        if(v[i]!=ar[i]){
            t++;
        }
    }
    if(t<=2){
        cout<<"YES"<<endl;
    } else {
        cout<<"NO"<<endl;
    }
}

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("inputf.in", "r", stdin);
    freopen("outputf.out", "w", stdout);
    #endif
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    int tc;
    // cin>>tc;
    tc=1;
    while(tc--){
        solve(tc);
    }
return 0;
}